Partitioning orthogonal polygons into fat rectangles in polynomial time
نویسندگان
چکیده
We provide a polynomial-time algorithm to partition an orthogonal polygon of n vertices into isothetic rectangles so that the shortest rectangle side is maximized over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat.”
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملAutomatic generation of 3-d building models from multiple bounded polygons
Based on building polygons (building footprints) on the digital map, we are proposing a GIS and CG integrated system to generate 3-D building models automatically. Most building polygons’ edges meet at right angles (orthogonal polygon). A complicated orthogonal polygon can be partitioned into a set of rectangles. In order to partition an orthogonal polygon, we proposed a useful polygon expressi...
متن کاملThe structure of optimal partitions of orthogonal polygons into fat rectangles
Motivated by a VLSI masking problem, we explore partitions of an orthogonal polygon of n vertices into isothetic rectangles that maximize the shortest rectangle side over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat.” We show that such partitions have a rich structure, more complex than what one might at first expect. For example, for partitions all “cuts” of which are a...
متن کاملAutomatic Generation of 3-D Building Models Based on a Digital Map
Based on building polygons (building footprints) on a digital map, we are proposing a GIS (Geographic Information System) and CG integrated system to generate 3-D building models automatically. Most building polygons‟ edges meet at right angles (orthogonal polygon). A complicated orthogonal polygon can be partitioned into a set of rectangles. In order to partition an orthogonal polygon, we prop...
متن کاملGIS and CG Integrated System for Automatic Generation of 3-D Building Models based on a Digital Map
Based on building polygons, we are proposing a GIS(Geographic Information System) and CG integrated system to generate multiple roofed 3-D building models automatically. Building polygons are buildings’ contours on the digital map stored by GIS. A 3-D urban model including 3-D building models is the important information infrastructure that can be utilized in several fields, such as landscape e...
متن کامل